Factoring bivariate sparse (lacunary) polynomials
نویسندگان
چکیده
منابع مشابه
Factoring bivariate sparse (lacunary) polynomials
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their multiplicities, whose running time is polynomial in the bit length of the sparse encoding of the input and in d . Moreover, we show that the factors over Q of degree ≤ d which are not binomials can also be computed in tim...
متن کاملFactoring bivariate polynomials using adjoints
We relate factorization of bivariate polynomials to singularities of projective plane curves. We prove that adjoint polynomials of a polynomial F ∈ k[x, y] with coefficients in a field k permit to recombinations of the factors of F (0, y) induced by both the absolute and rational factorizations of F , and so without using Hensel lifting. We show in such a way that a fast computation of adjoint ...
متن کاملDeterministically Factoring Sparse Polynomials into Multilinear Factors
We present the first efficient deterministic algorithm for factoring sparse polynomials that split into multilinear factors. Our result makes partial progress towards the resolution of the classical question posed by von zur Gathen and Kaltofen in [GK85] to devise an efficient deterministic algorithm for factoring (general) sparse polynomials. We achieve our goal by introducing essential factor...
متن کاملHybrid Sparse Resultant Matrices for Bivariate Polynomials
We study systems of three bivariate polynomials whose Newton polygons are scaled copies of a single polygon. Our main contribution is to construct square resultant matrices, which are submatrices of those introduced by Cattani et al. (1998), and whose determinants are nontrivial multiples of the sparse (or toric) resultant. The matrix is hybrid in that it contains a submatrix of Sylvester type ...
متن کاملFactoring Polynomials
Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent of computers and the resultant development of error-correcting codes, factoring over finite fields (e.g., Zp, for p a prime number) has become important as well. To understand this discussion, you need to know what polynomials are, and how to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2007
ISSN: 0885-064X
DOI: 10.1016/j.jco.2006.06.002